The defining core of a theory of infinitary term rewriting is its notion of convergence for transfinite reductions: which transfinite reductions
نویسندگان
چکیده
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial order model restricted to total terms. Hence, partial order convergence constitutes a conservative extension of metric convergence, which additionally offers a fine-grained distinction between different levels of divergence. In the second part, we focus our investigation on strong convergence of orthogonal systems. The main result is that the gap between the metric model and the partial order model can be bridged by extending the term rewriting system by additional rules. These extensions are the well-known Böhm extensions. Based on this result, we are able to establish that – contrary to the metric setting – orthogonal systems are both infinitarily confluent and infinitarily normalising in the partial order setting. The unique infinitary normal forms that the partial order model admits are Böhm trees.
منابع مشابه
Infinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions, and in the last decade research has mostly focused around the former. Finitary rewriting has a strong connect...
متن کاملBöhm Reduction in Infinitary Term Graph Rewriting Systems
The confluence properties of lambda calculus and orthogonal term rewriting do not generalise to the corresponding infinitary calculi. In order to recover the confluence property in a meaningful way, Kennaway et al. [11, 10] introduced Böhm reduction, which extends the ordinary reduction relation so that ‘meaningless terms’ can be contracted to a fresh constant ⊥. In previous work, we have estab...
متن کاملTransfinite Reductions in Orthogonal Term Rewriting Systems
We establish some fundamental facts for infinitary orthogonal term rewriting systems (OTRSs): for strongly convergent reductions we prove the Transfinite Parallel Moves Lemma and the Compressing Lemma. Strongness is necessary as shown by counterexamples. Normal forms (which we allow to be infinite) are unique, in contrast to ω-normal forms. Fair reductions result in ω-normal forms if they are c...
متن کاملInfinitary Lambda Calculi and Böhm Models
Infinitely long rewrite sequences of possibly infinite terms are of interest for several reasons. Firstly, infinitary rewriting is a natural generalisation of finitary rewriting which extends it with the notion of computing towards a possibily infinite limit. Such limits naturally arise in the semantics of lazy functional languages, in which it is possible to write and compute with expressions ...
متن کاملModular Implementation of Programming Languages and a Partial Order Approach to Infinitary Rewriting
This dissertation is a collection of nine research papers pertaining to two independent areas of research. In the first part, entitled Modular Implementation of Programming Languages, we develop techniques for implementing programming languages in a modular fashion. Within this problem domain, we focus on operations on typed abstract syntax trees with the goal of developing a framework that fac...
متن کامل